Disciplined quasiconvex programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasiconvex Programming

We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization techn...

متن کامل

Disciplined Convex Programming∗

Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear programming (LP), and convex quadratic programming (QP). This generalization is achieved while maintaining many of the important, attractive theoretical properties of these predecessors. Numerical algorithms for solving convex programs are maturing rapidly, providing reliabili...

متن کامل

Disjunctive Quasiconvex Programming and Other Nonconvex Problems

A disjunctive programming problem corresponds to the minimization of an objective function on a constraint set which is a union of sets, for example, min f (x) s.t. min j∈ J g j (x) ≤ 0 where the functions f and g j are real valued defined on a Banach space X and J is a (possibly infinite) index set. This class of problems has been introduced by Balas [4] in 1974 and then studied by many author...

متن کامل

Generalized Proximal Point Algorithms for Quasiconvex Programming

In this paper, we proposed algorithms interior proximal methods based on entropylike distance for the minimization of the quasiconvex function subjected to nonnegativity constraints. Under the assumptions that the objective function is bounded below and continuously differentiable, we established the well definedness of the sequence generated by the algorithms and obtained two important converg...

متن کامل

Disciplined Multi-core Programming in C

The problem of programmability on modern heterogeneous multi-core and future many-core embedded platforms is still not solved satisfactorily: although many existing but incompatible approaches do provide new languages, language extensions and library interfaces that all focus on specific solutions, and powerful analytical models do exist, no single integrated programming model has been proposed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2020

ISSN: 1862-4472,1862-4480

DOI: 10.1007/s11590-020-01561-8